A New Special-Purpose Factorization Algorithm
نویسنده
چکیده
In this paper, a new factorization algorithm is presented, which finds a prime factor p of an integer n in time (D log n)O(1), if 4p − 1 = Db2 where D and b are integers. Hence this algorithm will factor a number efficiently, if it has a prime factor p such that 4p−1 is a product of a small integer and a square. Such primes should be avoided when we select the RSA secret keys. Some generalizations of the algorithm are discussed in the paper as well. Classification of Topics: Cryptography, Integer factorization.
منابع مشابه
Special-Purpose Hardware for Factoring:the NFS Sieving Step
In the quest for factorization of larger integers, the present bottleneck is the sieving step of the Number Field Sieve algorithm. Several special-purpose hardware architectures have been proposed for this step: TWINKLE (based on electro-optics), mesh circuits (based on two-dimensional systolic arrays) and TWIRL (based on parallel processing pipelines). For 1024-bit composites, the use of such ...
متن کاملAn alternating direction and projection algorithm for structure-enforced matrix factorization
Structure-enforced matrix factorization (SeMF) represents a large class of mathematical models appearing in various forms of principal component analysis, sparse coding, dictionary learning and other machine learning techniques useful in many applications including neuroscience and signal processing. In this paper, we present a unified algorithm framework, based on the classic alternating direc...
متن کاملCost analysis of hash collisions: Will quantum computers make SHARCS obsolete?
Current proposals for special-purpose factorization hardware will become obsolete if large quantum computers are built: the numberfield sieve scales much more poorly than Shor’s quantum algorithm for factorization. Will all special-purpose cryptanalytic hardware become obsolete in a post-quantum world? A quantum algorithm by Brassard, Høyer, and Tapp has frequently been claimed to reduce the co...
متن کاملVoice-based Age and Gender Recognition using Training Generative Sparse Model
Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...
متن کاملA New Class of Unsafe Primes
In this paper, a new special-purpose factorization algorithm is presented, which finds a prime factor p of an integer n in polynomial time, if 4p− 1 has the form db2 where d ∈ {3, 11, 19, 43, 67, 163} and b is an integer. Hence such primes should be avoided when we select the RSA secret keys. Some generalizations of the algorithm are discussed in the paper as well.
متن کامل